Generic Framework for Key-Guessing Improvements
نویسندگان
چکیده
We propose a general technique to improve the key-guessing step of several attacks on block ciphers. This is achieved by defining and studying some new properties associated S-boxes representing them as special type decision trees that are crucial for finding fine-grained guessing strategies various attack vectors. have proposed implemented algorithm efficiently finds such trees, use it providing applications this approach, which include best known Noekeon, GIFT, RECTANGLE.
منابع مشابه
Key Improvements to XTR
This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three at the cost of a small one time computation for the recipient of the key. Furthermore, the parameter set-up for an XTR system can be simplified because th...
متن کاملKey Factors for Defining the Conceptual Framework for Quality Assurance in E-Learning
E-learning has evolved for more than a decade, and universities are gradually embracing e-learning to provide more learning experience for their learners. E-learning is the use of electronic means through which training is received and obtained. E-learning offers a wide range of advantages (time and room mobility, cost-effectiveness, etc.) and also overcomes the limitations of digital learning ...
متن کاملA Generic Framework for Genericity
Recently, generic programming becomes of a major interest in several programming paradigms. A recurrent idea to achieve genericity is to specify algorithms on their convenient data structure, and to allow these speciications to be instantiated onto a large number of neighboring data structures. Polytypic programming, shapely types and generic attribute grammars are generic programming methods r...
متن کاملGeneric Side-Channel Distinguishers: Improvements and Limitations
The goal of generic side-channel distinguishers is to allow key recoveries against any type of implementation, under minimum assumptions on the underlying hardware. Such distinguishers are particularly interesting in view of recent technological advances. Indeed, the traditional leakage models used in side-channel attacks, based on the Hamming weight or distance of the data contained in an impl...
متن کاملGeneric Related-Key Attacks for HMAC
In this article we describe new generic distinguishing and forgery attacks in the related-key scenario (using only a single related-key) for the HMAC construction. When HMAC uses a k-bit key, outputs an n-bit MAC, and is instantiated with an l-bit inner iterative hash function processing m-bit message blocks where m = k, our distinguishing-R attack requires about 2 queries which improves over t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-92062-3_16